global minimum point meaning in Chinese
全局极小点
Examples
- Two convergence theorems , which show that under suitable conditions evolution strategy asymptotically converges to a global minimum point with probability one , are given
对于有界闭集上的连续函数，证明了进化策略以概率为1收敛(几乎处处收敛)于优化问题的全局极小点。 - Martin ( ref . 36 ) proved the equivalence between some invexity and the case that every stationary point or kuhn - tucker point is a global minimum point for unconstrained or constrained scalar programming
Martin在文献[ 36 ]中，证明了无约束或约束单目标规划中某类不变凸性与每个驻点(或k - t点)即为全局最优点的等价性。 - Then based on the idea of predictive motion vector , using of spatial correlation of adjacent block and global minimum points probability distribution characteristic , predictive diamond searching ( pds ) and its advanced mode : adaptive pds ( apds ) are introduced . finally the algorithm of pds and apds and its simulation results comparing with conventional me algorithm are given
然后基于预测性运动矢量的概念，利用相邻块运动矢量的相关性和全局极值点概率分布特性，提出了预测性菱形搜索算法和它的改进算法：自适应预测性菱形搜索法，设计出具体算法，并给出了与传统快速块匹配法比较的计算机仿真结果。 - A chaos search for implementing optimal multi - user detection in cdma system has been proposed . computer simulation illustrated that this way has many powerful abilities . its capability is better than the traditional detection and the multi - series detection , it is near to the omd which was presented by verdu , and then its beginning condition is insensitivity , near - far insensitivity , eliminate interference , it can converge to global minimum point and hold down the noise interference
通过仿真证明：其性能优于传统检测器( cd ) 、多级多用户检测器( msd )而接近于文献[ 1 ]中提出的最佳多用户检测器( omd ) ，具有对初始条件不敏感、对“远近”问题不敏感和优良的抗干扰性能，并提高了通信系统的系统容量，能寻优到全局极小点，以及能抑制噪声干扰，而且，计算复杂度较低。 - 7 . for the purpose of analyzing its asymptotic convergence properties the evolution strategy procedures for real - valued function optimization are described . two convergence theorems , which show that under suitable conditions the evolution strategy asymptotically converges to a global minimum point with probability one , are given
对于有界闭集上的连续函数，利用作者给出的一种简洁的方法，证明了一类进化策略以概率为1收敛（几乎处处收敛）于优化问题的全局极小点，为进化算法的收敛性分析提供了一种新的模式。